A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

We give the first 2-approximation algorithm for cluster vertex deletion problem. This is tight, since approximating problem within any constant factor smaller than 2 UGC-hard. Our combines previous approaches, based on local ratio technique and management of true twins, with a novel construction “good” cost function vertices at distance most from input graph.